Symmetry Breaking in Constraint Satisfaction
نویسندگان
چکیده
منابع مشابه
An approach to Symmetry Breaking in Distributed Constraint Satisfaction Problems
Symmetry breaking in Distributed Constraint Satisfaction Problems (DisCSPs) has, to the best of our knowledge, not been investigated. In this paper, we show that most symmetries in DisCSPs are actually weak symmetries, and we demonstrate howweak symmetry breaking techniques can be applied to DisCSPs.
متن کاملConditional Symmetry Breaking
We introduce the study of Conditional symmetry breaking in constraint programming. This arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Conditional symmetry can cause redundancy in a systematic search for solutions. Breaking this symmetry is an important part of solving a constraint satisfaction ...
متن کاملApproaches to Conditional Symmetry Breaking
Conditional symmetry arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Typically, the condition is a set of assignments of values to variables, i.e. a partial assignment reached during systematic search. Like unconditional symmetry, conditional symmetry can cause redundancy in a systematic search f...
متن کاملGeneral Symmetry Breaking Constraints
We describe some new propagators for breaking symmetries in constraint satisfaction problems. We also introduce symmetry breaking constraints to deal with symmetries acting simultaneously on variables and values, conditional symmetries, as well as symmeties acting on set and other types of variables.
متن کاملStructural Symmetry Breaking
Symmetry breaking has been shown to be an important method to speed up the search in constraint satisfaction problems that contain symmetry. When breaking symmetry by dominance detection, a computationally efficient symmetry breaking scheme can be achieved if we can solve the dominance detection problem in polynomial time. We study the complexity of dominance detection when value and variable s...
متن کاملEfficient Structural Symmetry Breaking for Constraint Satisfaction Problems
Symmetry breaking for constraint satisfaction problems (CSPs) has attracted considerable attention in recent years. Various general schemes have been proposed to eliminate symmetries. In general, these schemes may take exponential space or time to eliminate all the symmetries. We identify several classes of CSPs that encompass many practical problems and for which symmetry breaking for various ...
متن کامل